An Upper Bound of the Minimal Dispersion via Delta Covers

نویسنده

  • Daniel Rudolf
چکیده

For a point set of n elements in the d-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers n, d and under the assumption of a δ -cover with cardinality |Γδ | we prove that there is a point set, such that the largest volume of such a test set without any point is bounded by log |Γδ | n + δ . For axis-parallel boxes on the unit cube this leads to a volume of at most 4d n log( 9n d ) and on the torus to 4d n log(2n).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separable programming problems with the max-product fuzzy relation equation constraints

In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...

متن کامل

An Upper Bound Analysis of Sandwich Sheet Rolling Process

In this research, flat rolling process of bonded sandwich sheets is investigated by the method of upper bound. A kinematically admissible velocity field is developed for a single layer sheet and is extended into the rolling of the symmetrical sandwich sheets. The internal, shear and frictional power terms are derived and they are used in the upper bound model. Through the analysis, the rolling ...

متن کامل

The distinguishing chromatic number of bipartite graphs of girth at least six

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

متن کامل

An Upper Bound on the First Zagreb Index in Trees

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

متن کامل

An Upper Bound Approach for Analysis of Hydroforming of Sheet Metals

Considering a kinematical velocity admissible field, the upper bound method has beenused for predicting the amount of pressure in hydroforming of sheet metals. The effects of workhardening, friction and blank size have been considered in pressure prediction. Also the effect ofsheet thickness variation has been considered in the present work formulations. The relation betweenpressure and punch s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1701.06430  شماره 

صفحات  -

تاریخ انتشار 2017